some optimal codes from designs
Authors
abstract
the binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. a new method is also introduced to study optimal codes.
similar resources
Some Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
full textsome designs and codes from l_2(q)
for $q in {7,8,9,11,13,16}$, we consider the primitive actions of $l_2(q)$ and use key-moori method 1 as described in [codes, designs and graphs from the janko groups {$j_1$} and{$j_2$}, {em j. combin. math. combin. comput.}, {bf 40} (2002) 143--159., correction to: ``codes, designs and graphs from the janko groups{$j_1$} and {$j_2$}'' [j. combin. math. combin. comput. {bf 40} (2002) 143--159],...
full textSome new D-optimal designs
We construct several new (v; r, 8; A) supplementary difference sets with v odd and T' + .5 = A + (v 1) /2. They give rise to D-optimal designs of order 2v. D-optimal designs of orders 158, 194, and 290 are constructed here for the first time. We also give an up to date survey of this class of supplementary difference sets in arbitrary Abelian groups of odd order v < 100. o. Introduction Supplem...
full textSome Optimal Codes as Tanner Codes with BCH Component Codes
In this paper we study a class of graph codes with BCH component codes as affine variety codes. We are able to find some optimal binary and ternary codes as Tanner codes with BCH component codes. We choose a special subgraph of the point-line incidence plane of P(2, q) as the Tanner graph, and we are able to describe the codes using Gröbner basis.
full textspace-time block codes from constituent intersectant orthogonal designs
in this paper, we propose space-time block codes based on constituent intersectant orthogonal designs. after channel model is formulated, we studied the space-time block codes from constituent intersectant orthogonal designs. at last we made simulations for the space-time block codes from complex orthogonal design and the space-time block codes from constituent intersectant orthogonal design to...
full textSome Block Designs Constructed from Resolvable Designs
LetD be a resolvable 2−(v, k, λ) design, andD′ be a 2−(v′, k′, λ′) design, such that v′ = v k . Further, let r and r′ be replication numbers of a point in D and D′, respectively. Shrikhande and Raghavarao proved that then there exists a 2 − (v′′, k′′, λ′′) design D′′, such that v′′ = v, k′′ = kk′ and λ′′ = r′λ + (r − λ)λ′. If D′ is resolvable, then D′′ is also resolvable. Applying this result, ...
full textMy Resources
Save resource for easier access later
Journal title:
bulletin of the iranian mathematical societyPublisher: iranian mathematical society (ims)
ISSN 1017-060X
volume 37
issue No. 3 2011
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023